A Degree-Constrained Minimum Spanning Tree Algorithm Using k-opt
نویسندگان
چکیده
منابع مشابه
Cross Decomposition of the Degree-Constrained Minimum Spanning Tree problem
As computer communication networks become a prevalent part in our daily life, the importance of efficient design of those networks becomes more evident. One of the critical issues in the network design process is the topological design problem involved in establishing a centralized data communication network with best performance and low costs. It can be recognized as a degree-constrained minim...
متن کاملA Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree and whose total edge length is minimum. We design a primal branch-and-cut algorithm that solves instances of the problem to optimality. Primal methods have not been used extensively in the past, and their performance ...
متن کاملA fast minimum spanning tree algorithm based on K-means
Article history: Received 14 June 2014 Received in revised form 25 September 2014 Accepted 3 October 2014 Available online 14 October 2014
متن کاملAn Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The representation of candidate solutions and the variation operators are fundamental design choices in an evolutionary algorithm (EA). This paper proposes a novel representation technique and suitable variation operators for the degree-constrained minimum spanning tree problem. For a weighted, undirected graph G(V, E), this problem seeks to identify the shortest spanning tree whose node degree...
متن کاملExact algorithm for delay-constrained capacitated minimum spanning tree network
The delay-constrained capacitated minimum spanning tree (DC-CMST) problem of finding several broadcast trees from a source node is discussed. While the traditional CMST problem deals with only the traffic capacity constraint served by a port of the source node, and delay-constrained minimum spanning tree (DCMST) considers only the maximum end–end delay constraint, the DC-CMST problem deals with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Society of Computer and Information
سال: 2015
ISSN: 1598-849X
DOI: 10.9708/jksci.2015.20.5.031